Multi-User Non-Locality Amplification
نویسندگان
چکیده
منابع مشابه
Multi-Photon Entanglement and Quantum Non-Locality
We review recent experiments concerning multi-photon Greenberger–Horne– Zeilinger (GHZ) entanglement. We have experimentally demonstrated GHZ entanglement of up to four photons by making use of pulsed parametric downconversion. On the basis of measurements on three-photon entanglement, we have realized the first experimental test of quantum non-locality following from the GHZ argument. Not only...
متن کاملEffects of Non-Ideal Pre-Distorter High Power Amplifiers in WCDMA Using Multi-User Detectors
Wide band code division multiple access (WCDMA) signals, transmitted by the base station high power amplifiers (HPAs), show high peak to average power ratios (PAPR), which results in nonlinear distortions. In this paper, using computer simulations effect of using a predistorted HPA on the symbol error rate (SER) of multi-user detectors in terms of output back-off (OBO) in the transmit power...
متن کاملA Novel Multi-user Detection Approach on Fluctuations of Autocorrelation Estimators in Non-Cooperative Communication
Recently, blind multi-user detection has become an important topic in code division multiple access (CDMA) systems. Direct-Sequence Spread Spectrum (DSSS) signals are well-known due to their low probability of detection, and secure communication. In this article, the problem of blind multi-user detection is studied in variable processing gain direct-sequence code division multiple access (VPG D...
متن کاملNon - locality requires fine tuning and multi - degenerate vacua
Our Multiple Point Principle (MPP) states that the realized values for e.g. the parameters of the standard model correspond to having a maximally degenerate vacuum. In the original appearence of MPP the gauge coupling values were predicted to within experimental uncertainties. A mechanism for fine-tuning follows in a natural way from the MPP. Using the cosmological constant as a example, we att...
متن کاملMulti-User Non-Interactive Verifiable Computation
Gennaro et al. (Crypto 2010) introduced the notion of verifiable computation, which allows a computationally weak client to outsource the computation of a function F on dynamically chosen inputs x1, . . . , x` to a more powerful but untrusted server. Following a pre-processing phase (that is only carried out once), the client can send some representation of its input xi to the server; the serve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2292515